Analysis of a Large Structure/Biological Activity Data Set Using Recursive Partitioning and Simulated Annealing

نویسندگان

  • Ke Zhang
  • Charles E. Smith
  • Jacqueline M. Hughes-Oliver
  • Jason A. Osborne
چکیده

Large quantities of structure and biological activity data are quickly accumulated with the development of high-throughput screening (HTS) and combinatorial chemistry. Analysis of structure-activity relationships (SAR) from such large data sets is becoming challenging. Recursive partitioning (RP) is a statistical method that can identify SAR rules for classes of compounds that are acting through different mechanisms in the same data set. We use a newly proposed method called Recursive Partitioning and Simulated Annealing (RP/SA) to produce stochastic regression trees for biological activity. In the new algorithm a set of structural descriptors is extracted at each splitting node by using SA as a stochastic optimization tool. For one data set, results show that RP/SA is advantageous in analyzing the SAR information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using design of experiments approach and simulated annealing algorithm for modeling and Optimization of EDM process parameters

The main objectives of this research are, therefore, to assess the effects of process parameters and to determine their optimal levels machining of Inconel 718 super alloy. gap voltage, current, time of machining and duty factor are tuning parameters considered to be study as process input parameters. Furthermore, two important process output characteristic, have been evaluated in this research...

متن کامل

Prediction of melting points of a diverse chemical set using fuzzy regression tree

The classification and regression trees (CART) possess the advantage of being able to handlelarge data sets and yield readily interpretable models. In spite to these advantages, they are alsorecognized as highly unstable classifiers with respect to minor perturbations in the training data.In the other words methods present high variance. Fuzzy logic brings in an improvement in theseaspects due ...

متن کامل

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

Predicting Implantation Outcome of In Vitro Fertilization and Intracytoplasmic Sperm Injection Using Data Mining Techniques

Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003